Markov bases of binary graph models of K4-minor free graphs
نویسندگان
چکیده
Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a graph has Markov width at most four if and only if it contains no K4 as a minor, answering a question of Develin and Sullivant. We also present a lower bound of order Ω(n2−ε) on the Markov width of Kn.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملHomomorphism bounds and edge-colourings of K4-minor-free graphs
We present a necessary and sufficient condition for a graph of odd-girth 2k + 1 to bound the class of K4-minor-free graphs of odd-girth (at least) 2k + 1, that is, to admit a homomorphism from any such K4-minor-free graph. This yields a polynomial-time algorithm to recognize such bounds. Using this condition, we first prove that every K4-minor free graph of odd-girth 2k+1 admits a homomorphism ...
متن کاملChoosability of Squares of K4-minor Free Graphs
Lih, Wang and Zhu [Discrete Math. 269 (2003), 303–309] proved that the chromatic number of the square of a K4-minor free graph with maximum degree ∆ is bounded by ⌊3∆/2⌋+1 if ∆ ≥ 4, and is at most ∆+3 for ∆ ∈ {2, 3}. We show that the same bounds hold for the list chromatic number of squares of K4-minor free graphs. The same result was also proved independently by Hetherington and Woodall.
متن کاملToughness threshold for the existence of 2-walks in K4-minor-free graphs
We show that every K4-minor free graph with toughness greater than 4/7 has a 2-walk, i.e., a closed walk visiting each vertex at most twice. We also give an example of a 4/7-tough K4-minor free graph with no 2-walk.
متن کاملDensity of universal classes of series-parallel graphs
A class of graphs C ordered by the homomorphism relation is universal if every countable partial order can be embedded in C. It was shown in [1] that the class Ck of k-colorable graphs, for any fixed k ≥ 3, induces a universal partial order. In [4], a surprisingly small subclass of C3 which is a proper subclass of K4-minor-free graphs (G/K4) is shown to be universal. In another direction, a den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 117 شماره
صفحات -
تاریخ انتشار 2010